Statistical Mechanics of Multi Terminal Data Compression — Theory and Practice —

This paper presents an efficient LDPC-based algorithm for multi-terminal data compression. In our scenario, a codeword sequence is calculated by multiplying a data sequence by a predetermined LDPC matrix. In contrast, the decoder generates a proper reproduction sequence for a codeword sequence using a message passing algorithm. The key result is the discovery that the LDPC coding technique can provide a suboptimal solution to problem of decoding, which often suffers from the dimension curse. Our analysis shows that the achievable rate region is described as first-order phase transitions among several phases. The typical performance of our practical decoder is also well evaluated by the replica method.